package com.test.basic;

import java.util.Collections;
import java.util.HashMap;
import java.util.concurrent.ConcurrentHashMap;

/**
 * 给你一个整数数组 nums，请你返回其中位数为 偶数 的数字的个数。
 *
 * 输入：nums = [12,345,2,6,7896]
 * 输出：2
 *
 */
public class FindNumbersDemo {
    public static void main(String[] args) {
        System.out.println(findNumbers(new int[]{12,345,2,6,7896}));
        HashMap map = new HashMap(1000);
        ConcurrentHashMap<Object, Object> hashMap = new ConcurrentHashMap<>();
        Collections.synchronizedMap(map);
        System.out.println(1 << 30);

    }
    public static int  findNumbers(int[] nums){
        int count = 0;
        for (int num : nums) {
            if(String.valueOf(num).length() % 2 ==0){
                count++;
            }
        }
        return count;
    }
}
